Power Domination in Honeycomb Meshes
نویسندگان
چکیده
The power domination problem is to find a minimum placement of phase measurement units (PMUs) for observing the whole electric power system represented by a graph G. The number of such a minimum placement of PMUs is called the power domination number of G and is denoted by γp(G). Finding γp(G) of an arbitrary graph is known to be NP-complete. In this paper, we deal with the power domination problem on honeycomb meshes. For a t-dimensional honeycomb mesh HMt, we show that γp(HMt) = d 3 e. In particular, we present an O(t)-time algorithm as the placement scheme.
منابع مشابه
Honeycomb Networks: Topological Properties and Communication Algorithms
The honeycomb mesh, based on hexagonal plane tessellation, is considered as a multiprocessor interconnection network. A honeycomb mesh network with n nodes has degree 3 and diameter a 1.63 n 1, which is 25 percent smaller degree and 18.5 percent smaller diameter than the mesh-connected computer with approximately the same number of nodes. Vertex and edge symmetric honeycomb torus network is obt...
متن کاملTotal and paired domination numbers of toroidal meshes
Let G be a graph without isolated vertices. The total domination number of G is the minimum number of vertices that can dominate all vertices in G, and the paired domination number of G is the minimum number of vertices in a dominating set whose induced subgraph contains a perfect matching. This paper determines the total domination number and the paired domination number of the toroidal meshes...
متن کاملHoneycomb rectangular disks
In this paper, we propose a variation of honeycomb meshes. A honeycomb rectangular disk HReD(m,n) is obtained from the honeycomb rectangular mesh HReM(m,n) by adding a boundary cycle. A honeycomb rectangular disk HReD(m,n) is a 3-regular planar graph. It is obvious that the honeycomb rectangular mesh HReM(m,n) is a subgraph of HReD(m,n). We also prove that HReD(m,n) is hamiltonian. Moreover, HR...
متن کاملDomination number of graph fractional powers
For any $k in mathbb{N}$, the $k$-subdivision of graph $G$ is a simple graph $G^{frac{1}{k}}$, which is constructed by replacing each edge of $G$ with a path of length $k$. In [Moharram N. Iradmusa, On colorings of graph fractional powers, Discrete Math., (310) 2010, No. 10-11, 1551-1556] the $m$th power of the $n$-subdivision of $G$ has been introduced as a fractional power of $G$, denoted by ...
متن کاملGeneralized power domination of graphs
In this paper, we introduce the concept of k-power domination which is a common generalization of domination and power domination. We extend several known results for power domination to k-power domination. Concerning the complexity of the k-power domination problem, we first show that deciding whether a graph admits a k-power dominating set of size at most t is NP-complete for chordal graphs a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Inf. Sci. Eng.
دوره 29 شماره
صفحات -
تاریخ انتشار 2013